Single Machine Scheduling Model with Total Tardiness Problem
نویسندگان
چکیده
منابع مشابه
Minimizing Total Weighted Tardiness with Drop Dead Dates in Single Machine Scheduling Problem
This paper deals with minimization of tardiness in single machine scheduling problem when each job has two different due-dates i.e. ordinary due-date and drop dead date. The drop dead date is the date in which jobs’ weights rise sharply or the customer cancels the order. A linear programming formulation is developed for the problem and since the problem is known to be NP-hard, three heuristic...
متن کاملThe single-machine total tardiness scheduling problem: Review and extensions
0377-2217/$ see front matter 2009 Elsevier B.V. A doi:10.1016/j.ejor.2009.04.007 * Tel.: +1 305 348 3309; fax: +1 305 348 4126. E-mail address: [email protected] We review the latest theoretical developments for the single-machine total tardiness 1== T scheduling problem and propose extensions to some of them. We also review (and in some cases extend) exact algorithms, fully polynomial time appr...
متن کاملOn the single machine total tardiness problem
In this paper we study the single machine total tardiness problem. We first identify some optimality properties based on which a special case with a given number of distinct due dates is proved polynomially solvable. The results are then extended to the case with release dates. 2004 Published by Elsevier B.V.
متن کاملSingle Machine Group Scheduling with Setups to Minimize Total Tardiness
This paper considers the single machine scheduling problem with independent family (group) setup times where jobs in each family are processed together. A sequence independent setup is required to process a job from a different family. The objective is to minimize total tardiness. A mixed integer programming model capable of solving small sized problems is described. Several heuristic algorithm...
متن کاملSingle .machine Total Weighted Tardiness with Release Dates Single Machine Total Weighted Tardiness with Release Dates
The single machine total weighted tardiness with release dates problem is known to be strongly NP-hard. With a new lower bounding scheme and a new upper bounding scheme, we get an efficient branch and bound algorithm. In the paper, we first introduce the history of the problem and its computational complexity. Second, the lower bounding schemes and the upper bounding schemes are described in de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indian Journal of Science and Technology
سال: 2016
ISSN: 0974-5645,0974-6846
DOI: 10.17485/ijst/2016/v9i37/97527